|
In mathematics, a polynomial decomposition expresses a polynomial ''f'' as the functional composition of polynomials ''g'' and ''h'', where ''g'' and ''h'' have degree greater than 1.〔Composition of polynomials may also be thought of as substitution of one polynomial as the value of the variable of another.〕 Algorithms are known for decomposing polynomials in polynomial time. Polynomials which are decomposable in this way are composite polynomials; those which are not are prime or indecomposable polynomials〔J.F. Ritt, "Prime and Composite Polynomials", ''Transactions of the American Mathematical Society'' 23:1:51-66 (January, 1922) 〕 (not to be confused with irreducible polynomials, which cannot be factored into products of polynomials). ==Examples== In the simplest case, one of the polynomials is a monomial. For example, : decomposes into : and since : Less trivially, : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Polynomial decomposition」の詳細全文を読む スポンサード リンク
|